Left Termination of the query pattern reach(b,b,b,b) w.r.t. the given Prolog program could not be shown:



PROLOG
  ↳ PrologToPiTRSProof
  ↳ PrologToPiTRSProof

reach4(X, Y, Edges, Visited) :- member2(.2(X, .2(Y, {}0)), Edges).
reach4(X, Z, Edges, Visited) :- member12(.2(X, .2(Y, {}0)), Edges), member2(Y, Visited), reach4(Y, Z, Edges, .2(Y, Visited)).
member2(H, .2(H, L)).
member2(X, .2(H, L)) :- member2(X, L).
member12(H, .2(H, L)).
member12(X, .2(H, L)) :- member12(X, L).


With regard to the inferred argument filtering the predicates were used in the following modes:
reach4: (b,b,b,b)
member2: (b,b)
member12: (f,b)
Transforming PROLOG into the following Term Rewriting System:
Pi-finite rewrite system:
The TRS R consists of the following rules:


reach_4_in_gggg4(X, Y, Edges, Visited) -> if_reach_4_in_1_gggg5(X, Y, Edges, Visited, member_2_in_gg2(._22(X, ._22(Y, []_0)), Edges))
member_2_in_gg2(H, ._22(H, L)) -> member_2_out_gg2(H, ._22(H, L))
member_2_in_gg2(X, ._22(H, L)) -> if_member_2_in_1_gg4(X, H, L, member_2_in_gg2(X, L))
if_member_2_in_1_gg4(X, H, L, member_2_out_gg2(X, L)) -> member_2_out_gg2(X, ._22(H, L))
if_reach_4_in_1_gggg5(X, Y, Edges, Visited, member_2_out_gg2(._22(X, ._22(Y, []_0)), Edges)) -> reach_4_out_gggg4(X, Y, Edges, Visited)
reach_4_in_gggg4(X, Z, Edges, Visited) -> if_reach_4_in_2_gggg5(X, Z, Edges, Visited, member1_2_in_ag2(._22(X, ._22(Y, []_0)), Edges))
member1_2_in_ag2(H, ._22(H, L)) -> member1_2_out_ag2(H, ._22(H, L))
member1_2_in_ag2(X, ._22(H, L)) -> if_member1_2_in_1_ag4(X, H, L, member1_2_in_ag2(X, L))
if_member1_2_in_1_ag4(X, H, L, member1_2_out_ag2(X, L)) -> member1_2_out_ag2(X, ._22(H, L))
if_reach_4_in_2_gggg5(X, Z, Edges, Visited, member1_2_out_ag2(._22(X, ._22(Y, []_0)), Edges)) -> if_reach_4_in_3_gggg6(X, Z, Edges, Visited, Y, member_2_in_gg2(Y, Visited))
if_reach_4_in_3_gggg6(X, Z, Edges, Visited, Y, member_2_out_gg2(Y, Visited)) -> if_reach_4_in_4_gggg6(X, Z, Edges, Visited, Y, reach_4_in_gggg4(Y, Z, Edges, ._22(Y, Visited)))
if_reach_4_in_4_gggg6(X, Z, Edges, Visited, Y, reach_4_out_gggg4(Y, Z, Edges, ._22(Y, Visited))) -> reach_4_out_gggg4(X, Z, Edges, Visited)

The argument filtering Pi contains the following mapping:
reach_4_in_gggg4(x1, x2, x3, x4)  =  reach_4_in_gggg4(x1, x2, x3, x4)
._22(x1, x2)  =  ._22(x1, x2)
[]_0  =  []_0
if_reach_4_in_1_gggg5(x1, x2, x3, x4, x5)  =  if_reach_4_in_1_gggg1(x5)
member_2_in_gg2(x1, x2)  =  member_2_in_gg2(x1, x2)
member_2_out_gg2(x1, x2)  =  member_2_out_gg
if_member_2_in_1_gg4(x1, x2, x3, x4)  =  if_member_2_in_1_gg1(x4)
reach_4_out_gggg4(x1, x2, x3, x4)  =  reach_4_out_gggg
if_reach_4_in_2_gggg5(x1, x2, x3, x4, x5)  =  if_reach_4_in_2_gggg4(x2, x3, x4, x5)
member1_2_in_ag2(x1, x2)  =  member1_2_in_ag1(x2)
member1_2_out_ag2(x1, x2)  =  member1_2_out_ag1(x1)
if_member1_2_in_1_ag4(x1, x2, x3, x4)  =  if_member1_2_in_1_ag1(x4)
if_reach_4_in_3_gggg6(x1, x2, x3, x4, x5, x6)  =  if_reach_4_in_3_gggg5(x2, x3, x4, x5, x6)
if_reach_4_in_4_gggg6(x1, x2, x3, x4, x5, x6)  =  if_reach_4_in_4_gggg1(x6)

Infinitary Constructor Rewriting Termination of PiTRS implies Termination of PROLOG



↳ PROLOG
  ↳ PrologToPiTRSProof
PiTRS
      ↳ DependencyPairsProof
  ↳ PrologToPiTRSProof

Pi-finite rewrite system:
The TRS R consists of the following rules:

reach_4_in_gggg4(X, Y, Edges, Visited) -> if_reach_4_in_1_gggg5(X, Y, Edges, Visited, member_2_in_gg2(._22(X, ._22(Y, []_0)), Edges))
member_2_in_gg2(H, ._22(H, L)) -> member_2_out_gg2(H, ._22(H, L))
member_2_in_gg2(X, ._22(H, L)) -> if_member_2_in_1_gg4(X, H, L, member_2_in_gg2(X, L))
if_member_2_in_1_gg4(X, H, L, member_2_out_gg2(X, L)) -> member_2_out_gg2(X, ._22(H, L))
if_reach_4_in_1_gggg5(X, Y, Edges, Visited, member_2_out_gg2(._22(X, ._22(Y, []_0)), Edges)) -> reach_4_out_gggg4(X, Y, Edges, Visited)
reach_4_in_gggg4(X, Z, Edges, Visited) -> if_reach_4_in_2_gggg5(X, Z, Edges, Visited, member1_2_in_ag2(._22(X, ._22(Y, []_0)), Edges))
member1_2_in_ag2(H, ._22(H, L)) -> member1_2_out_ag2(H, ._22(H, L))
member1_2_in_ag2(X, ._22(H, L)) -> if_member1_2_in_1_ag4(X, H, L, member1_2_in_ag2(X, L))
if_member1_2_in_1_ag4(X, H, L, member1_2_out_ag2(X, L)) -> member1_2_out_ag2(X, ._22(H, L))
if_reach_4_in_2_gggg5(X, Z, Edges, Visited, member1_2_out_ag2(._22(X, ._22(Y, []_0)), Edges)) -> if_reach_4_in_3_gggg6(X, Z, Edges, Visited, Y, member_2_in_gg2(Y, Visited))
if_reach_4_in_3_gggg6(X, Z, Edges, Visited, Y, member_2_out_gg2(Y, Visited)) -> if_reach_4_in_4_gggg6(X, Z, Edges, Visited, Y, reach_4_in_gggg4(Y, Z, Edges, ._22(Y, Visited)))
if_reach_4_in_4_gggg6(X, Z, Edges, Visited, Y, reach_4_out_gggg4(Y, Z, Edges, ._22(Y, Visited))) -> reach_4_out_gggg4(X, Z, Edges, Visited)

The argument filtering Pi contains the following mapping:
reach_4_in_gggg4(x1, x2, x3, x4)  =  reach_4_in_gggg4(x1, x2, x3, x4)
._22(x1, x2)  =  ._22(x1, x2)
[]_0  =  []_0
if_reach_4_in_1_gggg5(x1, x2, x3, x4, x5)  =  if_reach_4_in_1_gggg1(x5)
member_2_in_gg2(x1, x2)  =  member_2_in_gg2(x1, x2)
member_2_out_gg2(x1, x2)  =  member_2_out_gg
if_member_2_in_1_gg4(x1, x2, x3, x4)  =  if_member_2_in_1_gg1(x4)
reach_4_out_gggg4(x1, x2, x3, x4)  =  reach_4_out_gggg
if_reach_4_in_2_gggg5(x1, x2, x3, x4, x5)  =  if_reach_4_in_2_gggg4(x2, x3, x4, x5)
member1_2_in_ag2(x1, x2)  =  member1_2_in_ag1(x2)
member1_2_out_ag2(x1, x2)  =  member1_2_out_ag1(x1)
if_member1_2_in_1_ag4(x1, x2, x3, x4)  =  if_member1_2_in_1_ag1(x4)
if_reach_4_in_3_gggg6(x1, x2, x3, x4, x5, x6)  =  if_reach_4_in_3_gggg5(x2, x3, x4, x5, x6)
if_reach_4_in_4_gggg6(x1, x2, x3, x4, x5, x6)  =  if_reach_4_in_4_gggg1(x6)


Pi DP problem:
The TRS P consists of the following rules:

REACH_4_IN_GGGG4(X, Y, Edges, Visited) -> IF_REACH_4_IN_1_GGGG5(X, Y, Edges, Visited, member_2_in_gg2(._22(X, ._22(Y, []_0)), Edges))
REACH_4_IN_GGGG4(X, Y, Edges, Visited) -> MEMBER_2_IN_GG2(._22(X, ._22(Y, []_0)), Edges)
MEMBER_2_IN_GG2(X, ._22(H, L)) -> IF_MEMBER_2_IN_1_GG4(X, H, L, member_2_in_gg2(X, L))
MEMBER_2_IN_GG2(X, ._22(H, L)) -> MEMBER_2_IN_GG2(X, L)
REACH_4_IN_GGGG4(X, Z, Edges, Visited) -> IF_REACH_4_IN_2_GGGG5(X, Z, Edges, Visited, member1_2_in_ag2(._22(X, ._22(Y, []_0)), Edges))
REACH_4_IN_GGGG4(X, Z, Edges, Visited) -> MEMBER1_2_IN_AG2(._22(X, ._22(Y, []_0)), Edges)
MEMBER1_2_IN_AG2(X, ._22(H, L)) -> IF_MEMBER1_2_IN_1_AG4(X, H, L, member1_2_in_ag2(X, L))
MEMBER1_2_IN_AG2(X, ._22(H, L)) -> MEMBER1_2_IN_AG2(X, L)
IF_REACH_4_IN_2_GGGG5(X, Z, Edges, Visited, member1_2_out_ag2(._22(X, ._22(Y, []_0)), Edges)) -> IF_REACH_4_IN_3_GGGG6(X, Z, Edges, Visited, Y, member_2_in_gg2(Y, Visited))
IF_REACH_4_IN_2_GGGG5(X, Z, Edges, Visited, member1_2_out_ag2(._22(X, ._22(Y, []_0)), Edges)) -> MEMBER_2_IN_GG2(Y, Visited)
IF_REACH_4_IN_3_GGGG6(X, Z, Edges, Visited, Y, member_2_out_gg2(Y, Visited)) -> IF_REACH_4_IN_4_GGGG6(X, Z, Edges, Visited, Y, reach_4_in_gggg4(Y, Z, Edges, ._22(Y, Visited)))
IF_REACH_4_IN_3_GGGG6(X, Z, Edges, Visited, Y, member_2_out_gg2(Y, Visited)) -> REACH_4_IN_GGGG4(Y, Z, Edges, ._22(Y, Visited))

The TRS R consists of the following rules:

reach_4_in_gggg4(X, Y, Edges, Visited) -> if_reach_4_in_1_gggg5(X, Y, Edges, Visited, member_2_in_gg2(._22(X, ._22(Y, []_0)), Edges))
member_2_in_gg2(H, ._22(H, L)) -> member_2_out_gg2(H, ._22(H, L))
member_2_in_gg2(X, ._22(H, L)) -> if_member_2_in_1_gg4(X, H, L, member_2_in_gg2(X, L))
if_member_2_in_1_gg4(X, H, L, member_2_out_gg2(X, L)) -> member_2_out_gg2(X, ._22(H, L))
if_reach_4_in_1_gggg5(X, Y, Edges, Visited, member_2_out_gg2(._22(X, ._22(Y, []_0)), Edges)) -> reach_4_out_gggg4(X, Y, Edges, Visited)
reach_4_in_gggg4(X, Z, Edges, Visited) -> if_reach_4_in_2_gggg5(X, Z, Edges, Visited, member1_2_in_ag2(._22(X, ._22(Y, []_0)), Edges))
member1_2_in_ag2(H, ._22(H, L)) -> member1_2_out_ag2(H, ._22(H, L))
member1_2_in_ag2(X, ._22(H, L)) -> if_member1_2_in_1_ag4(X, H, L, member1_2_in_ag2(X, L))
if_member1_2_in_1_ag4(X, H, L, member1_2_out_ag2(X, L)) -> member1_2_out_ag2(X, ._22(H, L))
if_reach_4_in_2_gggg5(X, Z, Edges, Visited, member1_2_out_ag2(._22(X, ._22(Y, []_0)), Edges)) -> if_reach_4_in_3_gggg6(X, Z, Edges, Visited, Y, member_2_in_gg2(Y, Visited))
if_reach_4_in_3_gggg6(X, Z, Edges, Visited, Y, member_2_out_gg2(Y, Visited)) -> if_reach_4_in_4_gggg6(X, Z, Edges, Visited, Y, reach_4_in_gggg4(Y, Z, Edges, ._22(Y, Visited)))
if_reach_4_in_4_gggg6(X, Z, Edges, Visited, Y, reach_4_out_gggg4(Y, Z, Edges, ._22(Y, Visited))) -> reach_4_out_gggg4(X, Z, Edges, Visited)

The argument filtering Pi contains the following mapping:
reach_4_in_gggg4(x1, x2, x3, x4)  =  reach_4_in_gggg4(x1, x2, x3, x4)
._22(x1, x2)  =  ._22(x1, x2)
[]_0  =  []_0
if_reach_4_in_1_gggg5(x1, x2, x3, x4, x5)  =  if_reach_4_in_1_gggg1(x5)
member_2_in_gg2(x1, x2)  =  member_2_in_gg2(x1, x2)
member_2_out_gg2(x1, x2)  =  member_2_out_gg
if_member_2_in_1_gg4(x1, x2, x3, x4)  =  if_member_2_in_1_gg1(x4)
reach_4_out_gggg4(x1, x2, x3, x4)  =  reach_4_out_gggg
if_reach_4_in_2_gggg5(x1, x2, x3, x4, x5)  =  if_reach_4_in_2_gggg4(x2, x3, x4, x5)
member1_2_in_ag2(x1, x2)  =  member1_2_in_ag1(x2)
member1_2_out_ag2(x1, x2)  =  member1_2_out_ag1(x1)
if_member1_2_in_1_ag4(x1, x2, x3, x4)  =  if_member1_2_in_1_ag1(x4)
if_reach_4_in_3_gggg6(x1, x2, x3, x4, x5, x6)  =  if_reach_4_in_3_gggg5(x2, x3, x4, x5, x6)
if_reach_4_in_4_gggg6(x1, x2, x3, x4, x5, x6)  =  if_reach_4_in_4_gggg1(x6)
IF_MEMBER_2_IN_1_GG4(x1, x2, x3, x4)  =  IF_MEMBER_2_IN_1_GG1(x4)
IF_REACH_4_IN_4_GGGG6(x1, x2, x3, x4, x5, x6)  =  IF_REACH_4_IN_4_GGGG1(x6)
REACH_4_IN_GGGG4(x1, x2, x3, x4)  =  REACH_4_IN_GGGG4(x1, x2, x3, x4)
IF_REACH_4_IN_1_GGGG5(x1, x2, x3, x4, x5)  =  IF_REACH_4_IN_1_GGGG1(x5)
MEMBER_2_IN_GG2(x1, x2)  =  MEMBER_2_IN_GG2(x1, x2)
MEMBER1_2_IN_AG2(x1, x2)  =  MEMBER1_2_IN_AG1(x2)
IF_MEMBER1_2_IN_1_AG4(x1, x2, x3, x4)  =  IF_MEMBER1_2_IN_1_AG1(x4)
IF_REACH_4_IN_2_GGGG5(x1, x2, x3, x4, x5)  =  IF_REACH_4_IN_2_GGGG4(x2, x3, x4, x5)
IF_REACH_4_IN_3_GGGG6(x1, x2, x3, x4, x5, x6)  =  IF_REACH_4_IN_3_GGGG5(x2, x3, x4, x5, x6)

We have to consider all (P,R,Pi)-chains

↳ PROLOG
  ↳ PrologToPiTRSProof
    ↳ PiTRS
      ↳ DependencyPairsProof
PiDP
          ↳ DependencyGraphProof
  ↳ PrologToPiTRSProof

Pi DP problem:
The TRS P consists of the following rules:

REACH_4_IN_GGGG4(X, Y, Edges, Visited) -> IF_REACH_4_IN_1_GGGG5(X, Y, Edges, Visited, member_2_in_gg2(._22(X, ._22(Y, []_0)), Edges))
REACH_4_IN_GGGG4(X, Y, Edges, Visited) -> MEMBER_2_IN_GG2(._22(X, ._22(Y, []_0)), Edges)
MEMBER_2_IN_GG2(X, ._22(H, L)) -> IF_MEMBER_2_IN_1_GG4(X, H, L, member_2_in_gg2(X, L))
MEMBER_2_IN_GG2(X, ._22(H, L)) -> MEMBER_2_IN_GG2(X, L)
REACH_4_IN_GGGG4(X, Z, Edges, Visited) -> IF_REACH_4_IN_2_GGGG5(X, Z, Edges, Visited, member1_2_in_ag2(._22(X, ._22(Y, []_0)), Edges))
REACH_4_IN_GGGG4(X, Z, Edges, Visited) -> MEMBER1_2_IN_AG2(._22(X, ._22(Y, []_0)), Edges)
MEMBER1_2_IN_AG2(X, ._22(H, L)) -> IF_MEMBER1_2_IN_1_AG4(X, H, L, member1_2_in_ag2(X, L))
MEMBER1_2_IN_AG2(X, ._22(H, L)) -> MEMBER1_2_IN_AG2(X, L)
IF_REACH_4_IN_2_GGGG5(X, Z, Edges, Visited, member1_2_out_ag2(._22(X, ._22(Y, []_0)), Edges)) -> IF_REACH_4_IN_3_GGGG6(X, Z, Edges, Visited, Y, member_2_in_gg2(Y, Visited))
IF_REACH_4_IN_2_GGGG5(X, Z, Edges, Visited, member1_2_out_ag2(._22(X, ._22(Y, []_0)), Edges)) -> MEMBER_2_IN_GG2(Y, Visited)
IF_REACH_4_IN_3_GGGG6(X, Z, Edges, Visited, Y, member_2_out_gg2(Y, Visited)) -> IF_REACH_4_IN_4_GGGG6(X, Z, Edges, Visited, Y, reach_4_in_gggg4(Y, Z, Edges, ._22(Y, Visited)))
IF_REACH_4_IN_3_GGGG6(X, Z, Edges, Visited, Y, member_2_out_gg2(Y, Visited)) -> REACH_4_IN_GGGG4(Y, Z, Edges, ._22(Y, Visited))

The TRS R consists of the following rules:

reach_4_in_gggg4(X, Y, Edges, Visited) -> if_reach_4_in_1_gggg5(X, Y, Edges, Visited, member_2_in_gg2(._22(X, ._22(Y, []_0)), Edges))
member_2_in_gg2(H, ._22(H, L)) -> member_2_out_gg2(H, ._22(H, L))
member_2_in_gg2(X, ._22(H, L)) -> if_member_2_in_1_gg4(X, H, L, member_2_in_gg2(X, L))
if_member_2_in_1_gg4(X, H, L, member_2_out_gg2(X, L)) -> member_2_out_gg2(X, ._22(H, L))
if_reach_4_in_1_gggg5(X, Y, Edges, Visited, member_2_out_gg2(._22(X, ._22(Y, []_0)), Edges)) -> reach_4_out_gggg4(X, Y, Edges, Visited)
reach_4_in_gggg4(X, Z, Edges, Visited) -> if_reach_4_in_2_gggg5(X, Z, Edges, Visited, member1_2_in_ag2(._22(X, ._22(Y, []_0)), Edges))
member1_2_in_ag2(H, ._22(H, L)) -> member1_2_out_ag2(H, ._22(H, L))
member1_2_in_ag2(X, ._22(H, L)) -> if_member1_2_in_1_ag4(X, H, L, member1_2_in_ag2(X, L))
if_member1_2_in_1_ag4(X, H, L, member1_2_out_ag2(X, L)) -> member1_2_out_ag2(X, ._22(H, L))
if_reach_4_in_2_gggg5(X, Z, Edges, Visited, member1_2_out_ag2(._22(X, ._22(Y, []_0)), Edges)) -> if_reach_4_in_3_gggg6(X, Z, Edges, Visited, Y, member_2_in_gg2(Y, Visited))
if_reach_4_in_3_gggg6(X, Z, Edges, Visited, Y, member_2_out_gg2(Y, Visited)) -> if_reach_4_in_4_gggg6(X, Z, Edges, Visited, Y, reach_4_in_gggg4(Y, Z, Edges, ._22(Y, Visited)))
if_reach_4_in_4_gggg6(X, Z, Edges, Visited, Y, reach_4_out_gggg4(Y, Z, Edges, ._22(Y, Visited))) -> reach_4_out_gggg4(X, Z, Edges, Visited)

The argument filtering Pi contains the following mapping:
reach_4_in_gggg4(x1, x2, x3, x4)  =  reach_4_in_gggg4(x1, x2, x3, x4)
._22(x1, x2)  =  ._22(x1, x2)
[]_0  =  []_0
if_reach_4_in_1_gggg5(x1, x2, x3, x4, x5)  =  if_reach_4_in_1_gggg1(x5)
member_2_in_gg2(x1, x2)  =  member_2_in_gg2(x1, x2)
member_2_out_gg2(x1, x2)  =  member_2_out_gg
if_member_2_in_1_gg4(x1, x2, x3, x4)  =  if_member_2_in_1_gg1(x4)
reach_4_out_gggg4(x1, x2, x3, x4)  =  reach_4_out_gggg
if_reach_4_in_2_gggg5(x1, x2, x3, x4, x5)  =  if_reach_4_in_2_gggg4(x2, x3, x4, x5)
member1_2_in_ag2(x1, x2)  =  member1_2_in_ag1(x2)
member1_2_out_ag2(x1, x2)  =  member1_2_out_ag1(x1)
if_member1_2_in_1_ag4(x1, x2, x3, x4)  =  if_member1_2_in_1_ag1(x4)
if_reach_4_in_3_gggg6(x1, x2, x3, x4, x5, x6)  =  if_reach_4_in_3_gggg5(x2, x3, x4, x5, x6)
if_reach_4_in_4_gggg6(x1, x2, x3, x4, x5, x6)  =  if_reach_4_in_4_gggg1(x6)
IF_MEMBER_2_IN_1_GG4(x1, x2, x3, x4)  =  IF_MEMBER_2_IN_1_GG1(x4)
IF_REACH_4_IN_4_GGGG6(x1, x2, x3, x4, x5, x6)  =  IF_REACH_4_IN_4_GGGG1(x6)
REACH_4_IN_GGGG4(x1, x2, x3, x4)  =  REACH_4_IN_GGGG4(x1, x2, x3, x4)
IF_REACH_4_IN_1_GGGG5(x1, x2, x3, x4, x5)  =  IF_REACH_4_IN_1_GGGG1(x5)
MEMBER_2_IN_GG2(x1, x2)  =  MEMBER_2_IN_GG2(x1, x2)
MEMBER1_2_IN_AG2(x1, x2)  =  MEMBER1_2_IN_AG1(x2)
IF_MEMBER1_2_IN_1_AG4(x1, x2, x3, x4)  =  IF_MEMBER1_2_IN_1_AG1(x4)
IF_REACH_4_IN_2_GGGG5(x1, x2, x3, x4, x5)  =  IF_REACH_4_IN_2_GGGG4(x2, x3, x4, x5)
IF_REACH_4_IN_3_GGGG6(x1, x2, x3, x4, x5, x6)  =  IF_REACH_4_IN_3_GGGG5(x2, x3, x4, x5, x6)

We have to consider all (P,R,Pi)-chains
The approximation of the Dependency Graph contains 3 SCCs with 7 less nodes.

↳ PROLOG
  ↳ PrologToPiTRSProof
    ↳ PiTRS
      ↳ DependencyPairsProof
        ↳ PiDP
          ↳ DependencyGraphProof
            ↳ AND
PiDP
                ↳ UsableRulesProof
              ↳ PiDP
              ↳ PiDP
  ↳ PrologToPiTRSProof

Pi DP problem:
The TRS P consists of the following rules:

MEMBER1_2_IN_AG2(X, ._22(H, L)) -> MEMBER1_2_IN_AG2(X, L)

The TRS R consists of the following rules:

reach_4_in_gggg4(X, Y, Edges, Visited) -> if_reach_4_in_1_gggg5(X, Y, Edges, Visited, member_2_in_gg2(._22(X, ._22(Y, []_0)), Edges))
member_2_in_gg2(H, ._22(H, L)) -> member_2_out_gg2(H, ._22(H, L))
member_2_in_gg2(X, ._22(H, L)) -> if_member_2_in_1_gg4(X, H, L, member_2_in_gg2(X, L))
if_member_2_in_1_gg4(X, H, L, member_2_out_gg2(X, L)) -> member_2_out_gg2(X, ._22(H, L))
if_reach_4_in_1_gggg5(X, Y, Edges, Visited, member_2_out_gg2(._22(X, ._22(Y, []_0)), Edges)) -> reach_4_out_gggg4(X, Y, Edges, Visited)
reach_4_in_gggg4(X, Z, Edges, Visited) -> if_reach_4_in_2_gggg5(X, Z, Edges, Visited, member1_2_in_ag2(._22(X, ._22(Y, []_0)), Edges))
member1_2_in_ag2(H, ._22(H, L)) -> member1_2_out_ag2(H, ._22(H, L))
member1_2_in_ag2(X, ._22(H, L)) -> if_member1_2_in_1_ag4(X, H, L, member1_2_in_ag2(X, L))
if_member1_2_in_1_ag4(X, H, L, member1_2_out_ag2(X, L)) -> member1_2_out_ag2(X, ._22(H, L))
if_reach_4_in_2_gggg5(X, Z, Edges, Visited, member1_2_out_ag2(._22(X, ._22(Y, []_0)), Edges)) -> if_reach_4_in_3_gggg6(X, Z, Edges, Visited, Y, member_2_in_gg2(Y, Visited))
if_reach_4_in_3_gggg6(X, Z, Edges, Visited, Y, member_2_out_gg2(Y, Visited)) -> if_reach_4_in_4_gggg6(X, Z, Edges, Visited, Y, reach_4_in_gggg4(Y, Z, Edges, ._22(Y, Visited)))
if_reach_4_in_4_gggg6(X, Z, Edges, Visited, Y, reach_4_out_gggg4(Y, Z, Edges, ._22(Y, Visited))) -> reach_4_out_gggg4(X, Z, Edges, Visited)

The argument filtering Pi contains the following mapping:
reach_4_in_gggg4(x1, x2, x3, x4)  =  reach_4_in_gggg4(x1, x2, x3, x4)
._22(x1, x2)  =  ._22(x1, x2)
[]_0  =  []_0
if_reach_4_in_1_gggg5(x1, x2, x3, x4, x5)  =  if_reach_4_in_1_gggg1(x5)
member_2_in_gg2(x1, x2)  =  member_2_in_gg2(x1, x2)
member_2_out_gg2(x1, x2)  =  member_2_out_gg
if_member_2_in_1_gg4(x1, x2, x3, x4)  =  if_member_2_in_1_gg1(x4)
reach_4_out_gggg4(x1, x2, x3, x4)  =  reach_4_out_gggg
if_reach_4_in_2_gggg5(x1, x2, x3, x4, x5)  =  if_reach_4_in_2_gggg4(x2, x3, x4, x5)
member1_2_in_ag2(x1, x2)  =  member1_2_in_ag1(x2)
member1_2_out_ag2(x1, x2)  =  member1_2_out_ag1(x1)
if_member1_2_in_1_ag4(x1, x2, x3, x4)  =  if_member1_2_in_1_ag1(x4)
if_reach_4_in_3_gggg6(x1, x2, x3, x4, x5, x6)  =  if_reach_4_in_3_gggg5(x2, x3, x4, x5, x6)
if_reach_4_in_4_gggg6(x1, x2, x3, x4, x5, x6)  =  if_reach_4_in_4_gggg1(x6)
MEMBER1_2_IN_AG2(x1, x2)  =  MEMBER1_2_IN_AG1(x2)

We have to consider all (P,R,Pi)-chains
For (infinitary) constructor rewriting we can delete all non-usable rules from R.

↳ PROLOG
  ↳ PrologToPiTRSProof
    ↳ PiTRS
      ↳ DependencyPairsProof
        ↳ PiDP
          ↳ DependencyGraphProof
            ↳ AND
              ↳ PiDP
                ↳ UsableRulesProof
PiDP
                    ↳ PiDPToQDPProof
              ↳ PiDP
              ↳ PiDP
  ↳ PrologToPiTRSProof

Pi DP problem:
The TRS P consists of the following rules:

MEMBER1_2_IN_AG2(X, ._22(H, L)) -> MEMBER1_2_IN_AG2(X, L)

R is empty.
The argument filtering Pi contains the following mapping:
._22(x1, x2)  =  ._22(x1, x2)
MEMBER1_2_IN_AG2(x1, x2)  =  MEMBER1_2_IN_AG1(x2)

We have to consider all (P,R,Pi)-chains
Transforming (infinitary) constructor rewriting Pi-DP problem into ordinary QDP problem by application of Pi.

↳ PROLOG
  ↳ PrologToPiTRSProof
    ↳ PiTRS
      ↳ DependencyPairsProof
        ↳ PiDP
          ↳ DependencyGraphProof
            ↳ AND
              ↳ PiDP
                ↳ UsableRulesProof
                  ↳ PiDP
                    ↳ PiDPToQDPProof
QDP
                        ↳ QDPSizeChangeProof
              ↳ PiDP
              ↳ PiDP
  ↳ PrologToPiTRSProof

Q DP problem:
The TRS P consists of the following rules:

MEMBER1_2_IN_AG1(._22(H, L)) -> MEMBER1_2_IN_AG1(L)

R is empty.
Q is empty.
We have to consider all (P,Q,R)-chains.
The head symbols of this DP problem are {MEMBER1_2_IN_AG1}.
By using the subterm criterion together with the size-change analysis we have proven that there are no infinite chains for this DP problem.

From the DPs we obtained the following set of size-change graphs:



↳ PROLOG
  ↳ PrologToPiTRSProof
    ↳ PiTRS
      ↳ DependencyPairsProof
        ↳ PiDP
          ↳ DependencyGraphProof
            ↳ AND
              ↳ PiDP
PiDP
                ↳ UsableRulesProof
              ↳ PiDP
  ↳ PrologToPiTRSProof

Pi DP problem:
The TRS P consists of the following rules:

MEMBER_2_IN_GG2(X, ._22(H, L)) -> MEMBER_2_IN_GG2(X, L)

The TRS R consists of the following rules:

reach_4_in_gggg4(X, Y, Edges, Visited) -> if_reach_4_in_1_gggg5(X, Y, Edges, Visited, member_2_in_gg2(._22(X, ._22(Y, []_0)), Edges))
member_2_in_gg2(H, ._22(H, L)) -> member_2_out_gg2(H, ._22(H, L))
member_2_in_gg2(X, ._22(H, L)) -> if_member_2_in_1_gg4(X, H, L, member_2_in_gg2(X, L))
if_member_2_in_1_gg4(X, H, L, member_2_out_gg2(X, L)) -> member_2_out_gg2(X, ._22(H, L))
if_reach_4_in_1_gggg5(X, Y, Edges, Visited, member_2_out_gg2(._22(X, ._22(Y, []_0)), Edges)) -> reach_4_out_gggg4(X, Y, Edges, Visited)
reach_4_in_gggg4(X, Z, Edges, Visited) -> if_reach_4_in_2_gggg5(X, Z, Edges, Visited, member1_2_in_ag2(._22(X, ._22(Y, []_0)), Edges))
member1_2_in_ag2(H, ._22(H, L)) -> member1_2_out_ag2(H, ._22(H, L))
member1_2_in_ag2(X, ._22(H, L)) -> if_member1_2_in_1_ag4(X, H, L, member1_2_in_ag2(X, L))
if_member1_2_in_1_ag4(X, H, L, member1_2_out_ag2(X, L)) -> member1_2_out_ag2(X, ._22(H, L))
if_reach_4_in_2_gggg5(X, Z, Edges, Visited, member1_2_out_ag2(._22(X, ._22(Y, []_0)), Edges)) -> if_reach_4_in_3_gggg6(X, Z, Edges, Visited, Y, member_2_in_gg2(Y, Visited))
if_reach_4_in_3_gggg6(X, Z, Edges, Visited, Y, member_2_out_gg2(Y, Visited)) -> if_reach_4_in_4_gggg6(X, Z, Edges, Visited, Y, reach_4_in_gggg4(Y, Z, Edges, ._22(Y, Visited)))
if_reach_4_in_4_gggg6(X, Z, Edges, Visited, Y, reach_4_out_gggg4(Y, Z, Edges, ._22(Y, Visited))) -> reach_4_out_gggg4(X, Z, Edges, Visited)

The argument filtering Pi contains the following mapping:
reach_4_in_gggg4(x1, x2, x3, x4)  =  reach_4_in_gggg4(x1, x2, x3, x4)
._22(x1, x2)  =  ._22(x1, x2)
[]_0  =  []_0
if_reach_4_in_1_gggg5(x1, x2, x3, x4, x5)  =  if_reach_4_in_1_gggg1(x5)
member_2_in_gg2(x1, x2)  =  member_2_in_gg2(x1, x2)
member_2_out_gg2(x1, x2)  =  member_2_out_gg
if_member_2_in_1_gg4(x1, x2, x3, x4)  =  if_member_2_in_1_gg1(x4)
reach_4_out_gggg4(x1, x2, x3, x4)  =  reach_4_out_gggg
if_reach_4_in_2_gggg5(x1, x2, x3, x4, x5)  =  if_reach_4_in_2_gggg4(x2, x3, x4, x5)
member1_2_in_ag2(x1, x2)  =  member1_2_in_ag1(x2)
member1_2_out_ag2(x1, x2)  =  member1_2_out_ag1(x1)
if_member1_2_in_1_ag4(x1, x2, x3, x4)  =  if_member1_2_in_1_ag1(x4)
if_reach_4_in_3_gggg6(x1, x2, x3, x4, x5, x6)  =  if_reach_4_in_3_gggg5(x2, x3, x4, x5, x6)
if_reach_4_in_4_gggg6(x1, x2, x3, x4, x5, x6)  =  if_reach_4_in_4_gggg1(x6)
MEMBER_2_IN_GG2(x1, x2)  =  MEMBER_2_IN_GG2(x1, x2)

We have to consider all (P,R,Pi)-chains
For (infinitary) constructor rewriting we can delete all non-usable rules from R.

↳ PROLOG
  ↳ PrologToPiTRSProof
    ↳ PiTRS
      ↳ DependencyPairsProof
        ↳ PiDP
          ↳ DependencyGraphProof
            ↳ AND
              ↳ PiDP
              ↳ PiDP
                ↳ UsableRulesProof
PiDP
                    ↳ PiDPToQDPProof
              ↳ PiDP
  ↳ PrologToPiTRSProof

Pi DP problem:
The TRS P consists of the following rules:

MEMBER_2_IN_GG2(X, ._22(H, L)) -> MEMBER_2_IN_GG2(X, L)

R is empty.
Pi is empty.
We have to consider all (P,R,Pi)-chains
Transforming (infinitary) constructor rewriting Pi-DP problem into ordinary QDP problem by application of Pi.

↳ PROLOG
  ↳ PrologToPiTRSProof
    ↳ PiTRS
      ↳ DependencyPairsProof
        ↳ PiDP
          ↳ DependencyGraphProof
            ↳ AND
              ↳ PiDP
              ↳ PiDP
                ↳ UsableRulesProof
                  ↳ PiDP
                    ↳ PiDPToQDPProof
QDP
                        ↳ QDPSizeChangeProof
              ↳ PiDP
  ↳ PrologToPiTRSProof

Q DP problem:
The TRS P consists of the following rules:

MEMBER_2_IN_GG2(X, ._22(H, L)) -> MEMBER_2_IN_GG2(X, L)

R is empty.
Q is empty.
We have to consider all (P,Q,R)-chains.
The head symbols of this DP problem are {MEMBER_2_IN_GG2}.
By using the subterm criterion together with the size-change analysis we have proven that there are no infinite chains for this DP problem.

From the DPs we obtained the following set of size-change graphs:



↳ PROLOG
  ↳ PrologToPiTRSProof
    ↳ PiTRS
      ↳ DependencyPairsProof
        ↳ PiDP
          ↳ DependencyGraphProof
            ↳ AND
              ↳ PiDP
              ↳ PiDP
PiDP
                ↳ UsableRulesProof
  ↳ PrologToPiTRSProof

Pi DP problem:
The TRS P consists of the following rules:

REACH_4_IN_GGGG4(X, Z, Edges, Visited) -> IF_REACH_4_IN_2_GGGG5(X, Z, Edges, Visited, member1_2_in_ag2(._22(X, ._22(Y, []_0)), Edges))
IF_REACH_4_IN_3_GGGG6(X, Z, Edges, Visited, Y, member_2_out_gg2(Y, Visited)) -> REACH_4_IN_GGGG4(Y, Z, Edges, ._22(Y, Visited))
IF_REACH_4_IN_2_GGGG5(X, Z, Edges, Visited, member1_2_out_ag2(._22(X, ._22(Y, []_0)), Edges)) -> IF_REACH_4_IN_3_GGGG6(X, Z, Edges, Visited, Y, member_2_in_gg2(Y, Visited))

The TRS R consists of the following rules:

reach_4_in_gggg4(X, Y, Edges, Visited) -> if_reach_4_in_1_gggg5(X, Y, Edges, Visited, member_2_in_gg2(._22(X, ._22(Y, []_0)), Edges))
member_2_in_gg2(H, ._22(H, L)) -> member_2_out_gg2(H, ._22(H, L))
member_2_in_gg2(X, ._22(H, L)) -> if_member_2_in_1_gg4(X, H, L, member_2_in_gg2(X, L))
if_member_2_in_1_gg4(X, H, L, member_2_out_gg2(X, L)) -> member_2_out_gg2(X, ._22(H, L))
if_reach_4_in_1_gggg5(X, Y, Edges, Visited, member_2_out_gg2(._22(X, ._22(Y, []_0)), Edges)) -> reach_4_out_gggg4(X, Y, Edges, Visited)
reach_4_in_gggg4(X, Z, Edges, Visited) -> if_reach_4_in_2_gggg5(X, Z, Edges, Visited, member1_2_in_ag2(._22(X, ._22(Y, []_0)), Edges))
member1_2_in_ag2(H, ._22(H, L)) -> member1_2_out_ag2(H, ._22(H, L))
member1_2_in_ag2(X, ._22(H, L)) -> if_member1_2_in_1_ag4(X, H, L, member1_2_in_ag2(X, L))
if_member1_2_in_1_ag4(X, H, L, member1_2_out_ag2(X, L)) -> member1_2_out_ag2(X, ._22(H, L))
if_reach_4_in_2_gggg5(X, Z, Edges, Visited, member1_2_out_ag2(._22(X, ._22(Y, []_0)), Edges)) -> if_reach_4_in_3_gggg6(X, Z, Edges, Visited, Y, member_2_in_gg2(Y, Visited))
if_reach_4_in_3_gggg6(X, Z, Edges, Visited, Y, member_2_out_gg2(Y, Visited)) -> if_reach_4_in_4_gggg6(X, Z, Edges, Visited, Y, reach_4_in_gggg4(Y, Z, Edges, ._22(Y, Visited)))
if_reach_4_in_4_gggg6(X, Z, Edges, Visited, Y, reach_4_out_gggg4(Y, Z, Edges, ._22(Y, Visited))) -> reach_4_out_gggg4(X, Z, Edges, Visited)

The argument filtering Pi contains the following mapping:
reach_4_in_gggg4(x1, x2, x3, x4)  =  reach_4_in_gggg4(x1, x2, x3, x4)
._22(x1, x2)  =  ._22(x1, x2)
[]_0  =  []_0
if_reach_4_in_1_gggg5(x1, x2, x3, x4, x5)  =  if_reach_4_in_1_gggg1(x5)
member_2_in_gg2(x1, x2)  =  member_2_in_gg2(x1, x2)
member_2_out_gg2(x1, x2)  =  member_2_out_gg
if_member_2_in_1_gg4(x1, x2, x3, x4)  =  if_member_2_in_1_gg1(x4)
reach_4_out_gggg4(x1, x2, x3, x4)  =  reach_4_out_gggg
if_reach_4_in_2_gggg5(x1, x2, x3, x4, x5)  =  if_reach_4_in_2_gggg4(x2, x3, x4, x5)
member1_2_in_ag2(x1, x2)  =  member1_2_in_ag1(x2)
member1_2_out_ag2(x1, x2)  =  member1_2_out_ag1(x1)
if_member1_2_in_1_ag4(x1, x2, x3, x4)  =  if_member1_2_in_1_ag1(x4)
if_reach_4_in_3_gggg6(x1, x2, x3, x4, x5, x6)  =  if_reach_4_in_3_gggg5(x2, x3, x4, x5, x6)
if_reach_4_in_4_gggg6(x1, x2, x3, x4, x5, x6)  =  if_reach_4_in_4_gggg1(x6)
REACH_4_IN_GGGG4(x1, x2, x3, x4)  =  REACH_4_IN_GGGG4(x1, x2, x3, x4)
IF_REACH_4_IN_2_GGGG5(x1, x2, x3, x4, x5)  =  IF_REACH_4_IN_2_GGGG4(x2, x3, x4, x5)
IF_REACH_4_IN_3_GGGG6(x1, x2, x3, x4, x5, x6)  =  IF_REACH_4_IN_3_GGGG5(x2, x3, x4, x5, x6)

We have to consider all (P,R,Pi)-chains
For (infinitary) constructor rewriting we can delete all non-usable rules from R.

↳ PROLOG
  ↳ PrologToPiTRSProof
    ↳ PiTRS
      ↳ DependencyPairsProof
        ↳ PiDP
          ↳ DependencyGraphProof
            ↳ AND
              ↳ PiDP
              ↳ PiDP
              ↳ PiDP
                ↳ UsableRulesProof
PiDP
                    ↳ PiDPToQDPProof
  ↳ PrologToPiTRSProof

Pi DP problem:
The TRS P consists of the following rules:

REACH_4_IN_GGGG4(X, Z, Edges, Visited) -> IF_REACH_4_IN_2_GGGG5(X, Z, Edges, Visited, member1_2_in_ag2(._22(X, ._22(Y, []_0)), Edges))
IF_REACH_4_IN_3_GGGG6(X, Z, Edges, Visited, Y, member_2_out_gg2(Y, Visited)) -> REACH_4_IN_GGGG4(Y, Z, Edges, ._22(Y, Visited))
IF_REACH_4_IN_2_GGGG5(X, Z, Edges, Visited, member1_2_out_ag2(._22(X, ._22(Y, []_0)), Edges)) -> IF_REACH_4_IN_3_GGGG6(X, Z, Edges, Visited, Y, member_2_in_gg2(Y, Visited))

The TRS R consists of the following rules:

member1_2_in_ag2(H, ._22(H, L)) -> member1_2_out_ag2(H, ._22(H, L))
member1_2_in_ag2(X, ._22(H, L)) -> if_member1_2_in_1_ag4(X, H, L, member1_2_in_ag2(X, L))
member_2_in_gg2(H, ._22(H, L)) -> member_2_out_gg2(H, ._22(H, L))
member_2_in_gg2(X, ._22(H, L)) -> if_member_2_in_1_gg4(X, H, L, member_2_in_gg2(X, L))
if_member1_2_in_1_ag4(X, H, L, member1_2_out_ag2(X, L)) -> member1_2_out_ag2(X, ._22(H, L))
if_member_2_in_1_gg4(X, H, L, member_2_out_gg2(X, L)) -> member_2_out_gg2(X, ._22(H, L))

The argument filtering Pi contains the following mapping:
._22(x1, x2)  =  ._22(x1, x2)
[]_0  =  []_0
member_2_in_gg2(x1, x2)  =  member_2_in_gg2(x1, x2)
member_2_out_gg2(x1, x2)  =  member_2_out_gg
if_member_2_in_1_gg4(x1, x2, x3, x4)  =  if_member_2_in_1_gg1(x4)
member1_2_in_ag2(x1, x2)  =  member1_2_in_ag1(x2)
member1_2_out_ag2(x1, x2)  =  member1_2_out_ag1(x1)
if_member1_2_in_1_ag4(x1, x2, x3, x4)  =  if_member1_2_in_1_ag1(x4)
REACH_4_IN_GGGG4(x1, x2, x3, x4)  =  REACH_4_IN_GGGG4(x1, x2, x3, x4)
IF_REACH_4_IN_2_GGGG5(x1, x2, x3, x4, x5)  =  IF_REACH_4_IN_2_GGGG4(x2, x3, x4, x5)
IF_REACH_4_IN_3_GGGG6(x1, x2, x3, x4, x5, x6)  =  IF_REACH_4_IN_3_GGGG5(x2, x3, x4, x5, x6)

We have to consider all (P,R,Pi)-chains
Transforming (infinitary) constructor rewriting Pi-DP problem into ordinary QDP problem by application of Pi.

↳ PROLOG
  ↳ PrologToPiTRSProof
    ↳ PiTRS
      ↳ DependencyPairsProof
        ↳ PiDP
          ↳ DependencyGraphProof
            ↳ AND
              ↳ PiDP
              ↳ PiDP
              ↳ PiDP
                ↳ UsableRulesProof
                  ↳ PiDP
                    ↳ PiDPToQDPProof
QDP
  ↳ PrologToPiTRSProof

Q DP problem:
The TRS P consists of the following rules:

REACH_4_IN_GGGG4(X, Z, Edges, Visited) -> IF_REACH_4_IN_2_GGGG4(Z, Edges, Visited, member1_2_in_ag1(Edges))
IF_REACH_4_IN_3_GGGG5(Z, Edges, Visited, Y, member_2_out_gg) -> REACH_4_IN_GGGG4(Y, Z, Edges, ._22(Y, Visited))
IF_REACH_4_IN_2_GGGG4(Z, Edges, Visited, member1_2_out_ag1(._22(X, ._22(Y, []_0)))) -> IF_REACH_4_IN_3_GGGG5(Z, Edges, Visited, Y, member_2_in_gg2(Y, Visited))

The TRS R consists of the following rules:

member1_2_in_ag1(._22(H, L)) -> member1_2_out_ag1(H)
member1_2_in_ag1(._22(H, L)) -> if_member1_2_in_1_ag1(member1_2_in_ag1(L))
member_2_in_gg2(H, ._22(H, L)) -> member_2_out_gg
member_2_in_gg2(X, ._22(H, L)) -> if_member_2_in_1_gg1(member_2_in_gg2(X, L))
if_member1_2_in_1_ag1(member1_2_out_ag1(X)) -> member1_2_out_ag1(X)
if_member_2_in_1_gg1(member_2_out_gg) -> member_2_out_gg

The set Q consists of the following terms:

member1_2_in_ag1(x0)
member_2_in_gg2(x0, x1)
if_member1_2_in_1_ag1(x0)
if_member_2_in_1_gg1(x0)

We have to consider all (P,Q,R)-chains.
The head symbols of this DP problem are {IF_REACH_4_IN_2_GGGG4, REACH_4_IN_GGGG4, IF_REACH_4_IN_3_GGGG5}.
With regard to the inferred argument filtering the predicates were used in the following modes:
reach4: (b,b,b,b)
member2: (b,b)
member12: (f,b)
Transforming PROLOG into the following Term Rewriting System:
Pi-finite rewrite system:
The TRS R consists of the following rules:

reach_4_in_gggg4(X, Y, Edges, Visited) -> if_reach_4_in_1_gggg5(X, Y, Edges, Visited, member_2_in_gg2(._22(X, ._22(Y, []_0)), Edges))
member_2_in_gg2(H, ._22(H, L)) -> member_2_out_gg2(H, ._22(H, L))
member_2_in_gg2(X, ._22(H, L)) -> if_member_2_in_1_gg4(X, H, L, member_2_in_gg2(X, L))
if_member_2_in_1_gg4(X, H, L, member_2_out_gg2(X, L)) -> member_2_out_gg2(X, ._22(H, L))
if_reach_4_in_1_gggg5(X, Y, Edges, Visited, member_2_out_gg2(._22(X, ._22(Y, []_0)), Edges)) -> reach_4_out_gggg4(X, Y, Edges, Visited)
reach_4_in_gggg4(X, Z, Edges, Visited) -> if_reach_4_in_2_gggg5(X, Z, Edges, Visited, member1_2_in_ag2(._22(X, ._22(Y, []_0)), Edges))
member1_2_in_ag2(H, ._22(H, L)) -> member1_2_out_ag2(H, ._22(H, L))
member1_2_in_ag2(X, ._22(H, L)) -> if_member1_2_in_1_ag4(X, H, L, member1_2_in_ag2(X, L))
if_member1_2_in_1_ag4(X, H, L, member1_2_out_ag2(X, L)) -> member1_2_out_ag2(X, ._22(H, L))
if_reach_4_in_2_gggg5(X, Z, Edges, Visited, member1_2_out_ag2(._22(X, ._22(Y, []_0)), Edges)) -> if_reach_4_in_3_gggg6(X, Z, Edges, Visited, Y, member_2_in_gg2(Y, Visited))
if_reach_4_in_3_gggg6(X, Z, Edges, Visited, Y, member_2_out_gg2(Y, Visited)) -> if_reach_4_in_4_gggg6(X, Z, Edges, Visited, Y, reach_4_in_gggg4(Y, Z, Edges, ._22(Y, Visited)))
if_reach_4_in_4_gggg6(X, Z, Edges, Visited, Y, reach_4_out_gggg4(Y, Z, Edges, ._22(Y, Visited))) -> reach_4_out_gggg4(X, Z, Edges, Visited)

The argument filtering Pi contains the following mapping:
reach_4_in_gggg4(x1, x2, x3, x4)  =  reach_4_in_gggg4(x1, x2, x3, x4)
._22(x1, x2)  =  ._22(x1, x2)
[]_0  =  []_0
if_reach_4_in_1_gggg5(x1, x2, x3, x4, x5)  =  if_reach_4_in_1_gggg5(x1, x2, x3, x4, x5)
member_2_in_gg2(x1, x2)  =  member_2_in_gg2(x1, x2)
member_2_out_gg2(x1, x2)  =  member_2_out_gg2(x1, x2)
if_member_2_in_1_gg4(x1, x2, x3, x4)  =  if_member_2_in_1_gg4(x1, x2, x3, x4)
reach_4_out_gggg4(x1, x2, x3, x4)  =  reach_4_out_gggg4(x1, x2, x3, x4)
if_reach_4_in_2_gggg5(x1, x2, x3, x4, x5)  =  if_reach_4_in_2_gggg5(x1, x2, x3, x4, x5)
member1_2_in_ag2(x1, x2)  =  member1_2_in_ag1(x2)
member1_2_out_ag2(x1, x2)  =  member1_2_out_ag2(x1, x2)
if_member1_2_in_1_ag4(x1, x2, x3, x4)  =  if_member1_2_in_1_ag3(x2, x3, x4)
if_reach_4_in_3_gggg6(x1, x2, x3, x4, x5, x6)  =  if_reach_4_in_3_gggg6(x1, x2, x3, x4, x5, x6)
if_reach_4_in_4_gggg6(x1, x2, x3, x4, x5, x6)  =  if_reach_4_in_4_gggg5(x1, x2, x3, x4, x6)

Infinitary Constructor Rewriting Termination of PiTRS implies Termination of PROLOG



↳ PROLOG
  ↳ PrologToPiTRSProof
  ↳ PrologToPiTRSProof
PiTRS
      ↳ DependencyPairsProof

Pi-finite rewrite system:
The TRS R consists of the following rules:

reach_4_in_gggg4(X, Y, Edges, Visited) -> if_reach_4_in_1_gggg5(X, Y, Edges, Visited, member_2_in_gg2(._22(X, ._22(Y, []_0)), Edges))
member_2_in_gg2(H, ._22(H, L)) -> member_2_out_gg2(H, ._22(H, L))
member_2_in_gg2(X, ._22(H, L)) -> if_member_2_in_1_gg4(X, H, L, member_2_in_gg2(X, L))
if_member_2_in_1_gg4(X, H, L, member_2_out_gg2(X, L)) -> member_2_out_gg2(X, ._22(H, L))
if_reach_4_in_1_gggg5(X, Y, Edges, Visited, member_2_out_gg2(._22(X, ._22(Y, []_0)), Edges)) -> reach_4_out_gggg4(X, Y, Edges, Visited)
reach_4_in_gggg4(X, Z, Edges, Visited) -> if_reach_4_in_2_gggg5(X, Z, Edges, Visited, member1_2_in_ag2(._22(X, ._22(Y, []_0)), Edges))
member1_2_in_ag2(H, ._22(H, L)) -> member1_2_out_ag2(H, ._22(H, L))
member1_2_in_ag2(X, ._22(H, L)) -> if_member1_2_in_1_ag4(X, H, L, member1_2_in_ag2(X, L))
if_member1_2_in_1_ag4(X, H, L, member1_2_out_ag2(X, L)) -> member1_2_out_ag2(X, ._22(H, L))
if_reach_4_in_2_gggg5(X, Z, Edges, Visited, member1_2_out_ag2(._22(X, ._22(Y, []_0)), Edges)) -> if_reach_4_in_3_gggg6(X, Z, Edges, Visited, Y, member_2_in_gg2(Y, Visited))
if_reach_4_in_3_gggg6(X, Z, Edges, Visited, Y, member_2_out_gg2(Y, Visited)) -> if_reach_4_in_4_gggg6(X, Z, Edges, Visited, Y, reach_4_in_gggg4(Y, Z, Edges, ._22(Y, Visited)))
if_reach_4_in_4_gggg6(X, Z, Edges, Visited, Y, reach_4_out_gggg4(Y, Z, Edges, ._22(Y, Visited))) -> reach_4_out_gggg4(X, Z, Edges, Visited)

The argument filtering Pi contains the following mapping:
reach_4_in_gggg4(x1, x2, x3, x4)  =  reach_4_in_gggg4(x1, x2, x3, x4)
._22(x1, x2)  =  ._22(x1, x2)
[]_0  =  []_0
if_reach_4_in_1_gggg5(x1, x2, x3, x4, x5)  =  if_reach_4_in_1_gggg5(x1, x2, x3, x4, x5)
member_2_in_gg2(x1, x2)  =  member_2_in_gg2(x1, x2)
member_2_out_gg2(x1, x2)  =  member_2_out_gg2(x1, x2)
if_member_2_in_1_gg4(x1, x2, x3, x4)  =  if_member_2_in_1_gg4(x1, x2, x3, x4)
reach_4_out_gggg4(x1, x2, x3, x4)  =  reach_4_out_gggg4(x1, x2, x3, x4)
if_reach_4_in_2_gggg5(x1, x2, x3, x4, x5)  =  if_reach_4_in_2_gggg5(x1, x2, x3, x4, x5)
member1_2_in_ag2(x1, x2)  =  member1_2_in_ag1(x2)
member1_2_out_ag2(x1, x2)  =  member1_2_out_ag2(x1, x2)
if_member1_2_in_1_ag4(x1, x2, x3, x4)  =  if_member1_2_in_1_ag3(x2, x3, x4)
if_reach_4_in_3_gggg6(x1, x2, x3, x4, x5, x6)  =  if_reach_4_in_3_gggg6(x1, x2, x3, x4, x5, x6)
if_reach_4_in_4_gggg6(x1, x2, x3, x4, x5, x6)  =  if_reach_4_in_4_gggg5(x1, x2, x3, x4, x6)


Pi DP problem:
The TRS P consists of the following rules:

REACH_4_IN_GGGG4(X, Y, Edges, Visited) -> IF_REACH_4_IN_1_GGGG5(X, Y, Edges, Visited, member_2_in_gg2(._22(X, ._22(Y, []_0)), Edges))
REACH_4_IN_GGGG4(X, Y, Edges, Visited) -> MEMBER_2_IN_GG2(._22(X, ._22(Y, []_0)), Edges)
MEMBER_2_IN_GG2(X, ._22(H, L)) -> IF_MEMBER_2_IN_1_GG4(X, H, L, member_2_in_gg2(X, L))
MEMBER_2_IN_GG2(X, ._22(H, L)) -> MEMBER_2_IN_GG2(X, L)
REACH_4_IN_GGGG4(X, Z, Edges, Visited) -> IF_REACH_4_IN_2_GGGG5(X, Z, Edges, Visited, member1_2_in_ag2(._22(X, ._22(Y, []_0)), Edges))
REACH_4_IN_GGGG4(X, Z, Edges, Visited) -> MEMBER1_2_IN_AG2(._22(X, ._22(Y, []_0)), Edges)
MEMBER1_2_IN_AG2(X, ._22(H, L)) -> IF_MEMBER1_2_IN_1_AG4(X, H, L, member1_2_in_ag2(X, L))
MEMBER1_2_IN_AG2(X, ._22(H, L)) -> MEMBER1_2_IN_AG2(X, L)
IF_REACH_4_IN_2_GGGG5(X, Z, Edges, Visited, member1_2_out_ag2(._22(X, ._22(Y, []_0)), Edges)) -> IF_REACH_4_IN_3_GGGG6(X, Z, Edges, Visited, Y, member_2_in_gg2(Y, Visited))
IF_REACH_4_IN_2_GGGG5(X, Z, Edges, Visited, member1_2_out_ag2(._22(X, ._22(Y, []_0)), Edges)) -> MEMBER_2_IN_GG2(Y, Visited)
IF_REACH_4_IN_3_GGGG6(X, Z, Edges, Visited, Y, member_2_out_gg2(Y, Visited)) -> IF_REACH_4_IN_4_GGGG6(X, Z, Edges, Visited, Y, reach_4_in_gggg4(Y, Z, Edges, ._22(Y, Visited)))
IF_REACH_4_IN_3_GGGG6(X, Z, Edges, Visited, Y, member_2_out_gg2(Y, Visited)) -> REACH_4_IN_GGGG4(Y, Z, Edges, ._22(Y, Visited))

The TRS R consists of the following rules:

reach_4_in_gggg4(X, Y, Edges, Visited) -> if_reach_4_in_1_gggg5(X, Y, Edges, Visited, member_2_in_gg2(._22(X, ._22(Y, []_0)), Edges))
member_2_in_gg2(H, ._22(H, L)) -> member_2_out_gg2(H, ._22(H, L))
member_2_in_gg2(X, ._22(H, L)) -> if_member_2_in_1_gg4(X, H, L, member_2_in_gg2(X, L))
if_member_2_in_1_gg4(X, H, L, member_2_out_gg2(X, L)) -> member_2_out_gg2(X, ._22(H, L))
if_reach_4_in_1_gggg5(X, Y, Edges, Visited, member_2_out_gg2(._22(X, ._22(Y, []_0)), Edges)) -> reach_4_out_gggg4(X, Y, Edges, Visited)
reach_4_in_gggg4(X, Z, Edges, Visited) -> if_reach_4_in_2_gggg5(X, Z, Edges, Visited, member1_2_in_ag2(._22(X, ._22(Y, []_0)), Edges))
member1_2_in_ag2(H, ._22(H, L)) -> member1_2_out_ag2(H, ._22(H, L))
member1_2_in_ag2(X, ._22(H, L)) -> if_member1_2_in_1_ag4(X, H, L, member1_2_in_ag2(X, L))
if_member1_2_in_1_ag4(X, H, L, member1_2_out_ag2(X, L)) -> member1_2_out_ag2(X, ._22(H, L))
if_reach_4_in_2_gggg5(X, Z, Edges, Visited, member1_2_out_ag2(._22(X, ._22(Y, []_0)), Edges)) -> if_reach_4_in_3_gggg6(X, Z, Edges, Visited, Y, member_2_in_gg2(Y, Visited))
if_reach_4_in_3_gggg6(X, Z, Edges, Visited, Y, member_2_out_gg2(Y, Visited)) -> if_reach_4_in_4_gggg6(X, Z, Edges, Visited, Y, reach_4_in_gggg4(Y, Z, Edges, ._22(Y, Visited)))
if_reach_4_in_4_gggg6(X, Z, Edges, Visited, Y, reach_4_out_gggg4(Y, Z, Edges, ._22(Y, Visited))) -> reach_4_out_gggg4(X, Z, Edges, Visited)

The argument filtering Pi contains the following mapping:
reach_4_in_gggg4(x1, x2, x3, x4)  =  reach_4_in_gggg4(x1, x2, x3, x4)
._22(x1, x2)  =  ._22(x1, x2)
[]_0  =  []_0
if_reach_4_in_1_gggg5(x1, x2, x3, x4, x5)  =  if_reach_4_in_1_gggg5(x1, x2, x3, x4, x5)
member_2_in_gg2(x1, x2)  =  member_2_in_gg2(x1, x2)
member_2_out_gg2(x1, x2)  =  member_2_out_gg2(x1, x2)
if_member_2_in_1_gg4(x1, x2, x3, x4)  =  if_member_2_in_1_gg4(x1, x2, x3, x4)
reach_4_out_gggg4(x1, x2, x3, x4)  =  reach_4_out_gggg4(x1, x2, x3, x4)
if_reach_4_in_2_gggg5(x1, x2, x3, x4, x5)  =  if_reach_4_in_2_gggg5(x1, x2, x3, x4, x5)
member1_2_in_ag2(x1, x2)  =  member1_2_in_ag1(x2)
member1_2_out_ag2(x1, x2)  =  member1_2_out_ag2(x1, x2)
if_member1_2_in_1_ag4(x1, x2, x3, x4)  =  if_member1_2_in_1_ag3(x2, x3, x4)
if_reach_4_in_3_gggg6(x1, x2, x3, x4, x5, x6)  =  if_reach_4_in_3_gggg6(x1, x2, x3, x4, x5, x6)
if_reach_4_in_4_gggg6(x1, x2, x3, x4, x5, x6)  =  if_reach_4_in_4_gggg5(x1, x2, x3, x4, x6)
IF_MEMBER_2_IN_1_GG4(x1, x2, x3, x4)  =  IF_MEMBER_2_IN_1_GG4(x1, x2, x3, x4)
IF_REACH_4_IN_4_GGGG6(x1, x2, x3, x4, x5, x6)  =  IF_REACH_4_IN_4_GGGG5(x1, x2, x3, x4, x6)
REACH_4_IN_GGGG4(x1, x2, x3, x4)  =  REACH_4_IN_GGGG4(x1, x2, x3, x4)
IF_REACH_4_IN_1_GGGG5(x1, x2, x3, x4, x5)  =  IF_REACH_4_IN_1_GGGG5(x1, x2, x3, x4, x5)
MEMBER_2_IN_GG2(x1, x2)  =  MEMBER_2_IN_GG2(x1, x2)
MEMBER1_2_IN_AG2(x1, x2)  =  MEMBER1_2_IN_AG1(x2)
IF_MEMBER1_2_IN_1_AG4(x1, x2, x3, x4)  =  IF_MEMBER1_2_IN_1_AG3(x2, x3, x4)
IF_REACH_4_IN_2_GGGG5(x1, x2, x3, x4, x5)  =  IF_REACH_4_IN_2_GGGG5(x1, x2, x3, x4, x5)
IF_REACH_4_IN_3_GGGG6(x1, x2, x3, x4, x5, x6)  =  IF_REACH_4_IN_3_GGGG6(x1, x2, x3, x4, x5, x6)

We have to consider all (P,R,Pi)-chains

↳ PROLOG
  ↳ PrologToPiTRSProof
  ↳ PrologToPiTRSProof
    ↳ PiTRS
      ↳ DependencyPairsProof
PiDP
          ↳ DependencyGraphProof

Pi DP problem:
The TRS P consists of the following rules:

REACH_4_IN_GGGG4(X, Y, Edges, Visited) -> IF_REACH_4_IN_1_GGGG5(X, Y, Edges, Visited, member_2_in_gg2(._22(X, ._22(Y, []_0)), Edges))
REACH_4_IN_GGGG4(X, Y, Edges, Visited) -> MEMBER_2_IN_GG2(._22(X, ._22(Y, []_0)), Edges)
MEMBER_2_IN_GG2(X, ._22(H, L)) -> IF_MEMBER_2_IN_1_GG4(X, H, L, member_2_in_gg2(X, L))
MEMBER_2_IN_GG2(X, ._22(H, L)) -> MEMBER_2_IN_GG2(X, L)
REACH_4_IN_GGGG4(X, Z, Edges, Visited) -> IF_REACH_4_IN_2_GGGG5(X, Z, Edges, Visited, member1_2_in_ag2(._22(X, ._22(Y, []_0)), Edges))
REACH_4_IN_GGGG4(X, Z, Edges, Visited) -> MEMBER1_2_IN_AG2(._22(X, ._22(Y, []_0)), Edges)
MEMBER1_2_IN_AG2(X, ._22(H, L)) -> IF_MEMBER1_2_IN_1_AG4(X, H, L, member1_2_in_ag2(X, L))
MEMBER1_2_IN_AG2(X, ._22(H, L)) -> MEMBER1_2_IN_AG2(X, L)
IF_REACH_4_IN_2_GGGG5(X, Z, Edges, Visited, member1_2_out_ag2(._22(X, ._22(Y, []_0)), Edges)) -> IF_REACH_4_IN_3_GGGG6(X, Z, Edges, Visited, Y, member_2_in_gg2(Y, Visited))
IF_REACH_4_IN_2_GGGG5(X, Z, Edges, Visited, member1_2_out_ag2(._22(X, ._22(Y, []_0)), Edges)) -> MEMBER_2_IN_GG2(Y, Visited)
IF_REACH_4_IN_3_GGGG6(X, Z, Edges, Visited, Y, member_2_out_gg2(Y, Visited)) -> IF_REACH_4_IN_4_GGGG6(X, Z, Edges, Visited, Y, reach_4_in_gggg4(Y, Z, Edges, ._22(Y, Visited)))
IF_REACH_4_IN_3_GGGG6(X, Z, Edges, Visited, Y, member_2_out_gg2(Y, Visited)) -> REACH_4_IN_GGGG4(Y, Z, Edges, ._22(Y, Visited))

The TRS R consists of the following rules:

reach_4_in_gggg4(X, Y, Edges, Visited) -> if_reach_4_in_1_gggg5(X, Y, Edges, Visited, member_2_in_gg2(._22(X, ._22(Y, []_0)), Edges))
member_2_in_gg2(H, ._22(H, L)) -> member_2_out_gg2(H, ._22(H, L))
member_2_in_gg2(X, ._22(H, L)) -> if_member_2_in_1_gg4(X, H, L, member_2_in_gg2(X, L))
if_member_2_in_1_gg4(X, H, L, member_2_out_gg2(X, L)) -> member_2_out_gg2(X, ._22(H, L))
if_reach_4_in_1_gggg5(X, Y, Edges, Visited, member_2_out_gg2(._22(X, ._22(Y, []_0)), Edges)) -> reach_4_out_gggg4(X, Y, Edges, Visited)
reach_4_in_gggg4(X, Z, Edges, Visited) -> if_reach_4_in_2_gggg5(X, Z, Edges, Visited, member1_2_in_ag2(._22(X, ._22(Y, []_0)), Edges))
member1_2_in_ag2(H, ._22(H, L)) -> member1_2_out_ag2(H, ._22(H, L))
member1_2_in_ag2(X, ._22(H, L)) -> if_member1_2_in_1_ag4(X, H, L, member1_2_in_ag2(X, L))
if_member1_2_in_1_ag4(X, H, L, member1_2_out_ag2(X, L)) -> member1_2_out_ag2(X, ._22(H, L))
if_reach_4_in_2_gggg5(X, Z, Edges, Visited, member1_2_out_ag2(._22(X, ._22(Y, []_0)), Edges)) -> if_reach_4_in_3_gggg6(X, Z, Edges, Visited, Y, member_2_in_gg2(Y, Visited))
if_reach_4_in_3_gggg6(X, Z, Edges, Visited, Y, member_2_out_gg2(Y, Visited)) -> if_reach_4_in_4_gggg6(X, Z, Edges, Visited, Y, reach_4_in_gggg4(Y, Z, Edges, ._22(Y, Visited)))
if_reach_4_in_4_gggg6(X, Z, Edges, Visited, Y, reach_4_out_gggg4(Y, Z, Edges, ._22(Y, Visited))) -> reach_4_out_gggg4(X, Z, Edges, Visited)

The argument filtering Pi contains the following mapping:
reach_4_in_gggg4(x1, x2, x3, x4)  =  reach_4_in_gggg4(x1, x2, x3, x4)
._22(x1, x2)  =  ._22(x1, x2)
[]_0  =  []_0
if_reach_4_in_1_gggg5(x1, x2, x3, x4, x5)  =  if_reach_4_in_1_gggg5(x1, x2, x3, x4, x5)
member_2_in_gg2(x1, x2)  =  member_2_in_gg2(x1, x2)
member_2_out_gg2(x1, x2)  =  member_2_out_gg2(x1, x2)
if_member_2_in_1_gg4(x1, x2, x3, x4)  =  if_member_2_in_1_gg4(x1, x2, x3, x4)
reach_4_out_gggg4(x1, x2, x3, x4)  =  reach_4_out_gggg4(x1, x2, x3, x4)
if_reach_4_in_2_gggg5(x1, x2, x3, x4, x5)  =  if_reach_4_in_2_gggg5(x1, x2, x3, x4, x5)
member1_2_in_ag2(x1, x2)  =  member1_2_in_ag1(x2)
member1_2_out_ag2(x1, x2)  =  member1_2_out_ag2(x1, x2)
if_member1_2_in_1_ag4(x1, x2, x3, x4)  =  if_member1_2_in_1_ag3(x2, x3, x4)
if_reach_4_in_3_gggg6(x1, x2, x3, x4, x5, x6)  =  if_reach_4_in_3_gggg6(x1, x2, x3, x4, x5, x6)
if_reach_4_in_4_gggg6(x1, x2, x3, x4, x5, x6)  =  if_reach_4_in_4_gggg5(x1, x2, x3, x4, x6)
IF_MEMBER_2_IN_1_GG4(x1, x2, x3, x4)  =  IF_MEMBER_2_IN_1_GG4(x1, x2, x3, x4)
IF_REACH_4_IN_4_GGGG6(x1, x2, x3, x4, x5, x6)  =  IF_REACH_4_IN_4_GGGG5(x1, x2, x3, x4, x6)
REACH_4_IN_GGGG4(x1, x2, x3, x4)  =  REACH_4_IN_GGGG4(x1, x2, x3, x4)
IF_REACH_4_IN_1_GGGG5(x1, x2, x3, x4, x5)  =  IF_REACH_4_IN_1_GGGG5(x1, x2, x3, x4, x5)
MEMBER_2_IN_GG2(x1, x2)  =  MEMBER_2_IN_GG2(x1, x2)
MEMBER1_2_IN_AG2(x1, x2)  =  MEMBER1_2_IN_AG1(x2)
IF_MEMBER1_2_IN_1_AG4(x1, x2, x3, x4)  =  IF_MEMBER1_2_IN_1_AG3(x2, x3, x4)
IF_REACH_4_IN_2_GGGG5(x1, x2, x3, x4, x5)  =  IF_REACH_4_IN_2_GGGG5(x1, x2, x3, x4, x5)
IF_REACH_4_IN_3_GGGG6(x1, x2, x3, x4, x5, x6)  =  IF_REACH_4_IN_3_GGGG6(x1, x2, x3, x4, x5, x6)

We have to consider all (P,R,Pi)-chains
The approximation of the Dependency Graph contains 3 SCCs with 7 less nodes.

↳ PROLOG
  ↳ PrologToPiTRSProof
  ↳ PrologToPiTRSProof
    ↳ PiTRS
      ↳ DependencyPairsProof
        ↳ PiDP
          ↳ DependencyGraphProof
            ↳ AND
PiDP
              ↳ PiDP
              ↳ PiDP

Pi DP problem:
The TRS P consists of the following rules:

MEMBER1_2_IN_AG2(X, ._22(H, L)) -> MEMBER1_2_IN_AG2(X, L)

The TRS R consists of the following rules:

reach_4_in_gggg4(X, Y, Edges, Visited) -> if_reach_4_in_1_gggg5(X, Y, Edges, Visited, member_2_in_gg2(._22(X, ._22(Y, []_0)), Edges))
member_2_in_gg2(H, ._22(H, L)) -> member_2_out_gg2(H, ._22(H, L))
member_2_in_gg2(X, ._22(H, L)) -> if_member_2_in_1_gg4(X, H, L, member_2_in_gg2(X, L))
if_member_2_in_1_gg4(X, H, L, member_2_out_gg2(X, L)) -> member_2_out_gg2(X, ._22(H, L))
if_reach_4_in_1_gggg5(X, Y, Edges, Visited, member_2_out_gg2(._22(X, ._22(Y, []_0)), Edges)) -> reach_4_out_gggg4(X, Y, Edges, Visited)
reach_4_in_gggg4(X, Z, Edges, Visited) -> if_reach_4_in_2_gggg5(X, Z, Edges, Visited, member1_2_in_ag2(._22(X, ._22(Y, []_0)), Edges))
member1_2_in_ag2(H, ._22(H, L)) -> member1_2_out_ag2(H, ._22(H, L))
member1_2_in_ag2(X, ._22(H, L)) -> if_member1_2_in_1_ag4(X, H, L, member1_2_in_ag2(X, L))
if_member1_2_in_1_ag4(X, H, L, member1_2_out_ag2(X, L)) -> member1_2_out_ag2(X, ._22(H, L))
if_reach_4_in_2_gggg5(X, Z, Edges, Visited, member1_2_out_ag2(._22(X, ._22(Y, []_0)), Edges)) -> if_reach_4_in_3_gggg6(X, Z, Edges, Visited, Y, member_2_in_gg2(Y, Visited))
if_reach_4_in_3_gggg6(X, Z, Edges, Visited, Y, member_2_out_gg2(Y, Visited)) -> if_reach_4_in_4_gggg6(X, Z, Edges, Visited, Y, reach_4_in_gggg4(Y, Z, Edges, ._22(Y, Visited)))
if_reach_4_in_4_gggg6(X, Z, Edges, Visited, Y, reach_4_out_gggg4(Y, Z, Edges, ._22(Y, Visited))) -> reach_4_out_gggg4(X, Z, Edges, Visited)

The argument filtering Pi contains the following mapping:
reach_4_in_gggg4(x1, x2, x3, x4)  =  reach_4_in_gggg4(x1, x2, x3, x4)
._22(x1, x2)  =  ._22(x1, x2)
[]_0  =  []_0
if_reach_4_in_1_gggg5(x1, x2, x3, x4, x5)  =  if_reach_4_in_1_gggg5(x1, x2, x3, x4, x5)
member_2_in_gg2(x1, x2)  =  member_2_in_gg2(x1, x2)
member_2_out_gg2(x1, x2)  =  member_2_out_gg2(x1, x2)
if_member_2_in_1_gg4(x1, x2, x3, x4)  =  if_member_2_in_1_gg4(x1, x2, x3, x4)
reach_4_out_gggg4(x1, x2, x3, x4)  =  reach_4_out_gggg4(x1, x2, x3, x4)
if_reach_4_in_2_gggg5(x1, x2, x3, x4, x5)  =  if_reach_4_in_2_gggg5(x1, x2, x3, x4, x5)
member1_2_in_ag2(x1, x2)  =  member1_2_in_ag1(x2)
member1_2_out_ag2(x1, x2)  =  member1_2_out_ag2(x1, x2)
if_member1_2_in_1_ag4(x1, x2, x3, x4)  =  if_member1_2_in_1_ag3(x2, x3, x4)
if_reach_4_in_3_gggg6(x1, x2, x3, x4, x5, x6)  =  if_reach_4_in_3_gggg6(x1, x2, x3, x4, x5, x6)
if_reach_4_in_4_gggg6(x1, x2, x3, x4, x5, x6)  =  if_reach_4_in_4_gggg5(x1, x2, x3, x4, x6)
MEMBER1_2_IN_AG2(x1, x2)  =  MEMBER1_2_IN_AG1(x2)

We have to consider all (P,R,Pi)-chains

↳ PROLOG
  ↳ PrologToPiTRSProof
  ↳ PrologToPiTRSProof
    ↳ PiTRS
      ↳ DependencyPairsProof
        ↳ PiDP
          ↳ DependencyGraphProof
            ↳ AND
              ↳ PiDP
PiDP
              ↳ PiDP

Pi DP problem:
The TRS P consists of the following rules:

MEMBER_2_IN_GG2(X, ._22(H, L)) -> MEMBER_2_IN_GG2(X, L)

The TRS R consists of the following rules:

reach_4_in_gggg4(X, Y, Edges, Visited) -> if_reach_4_in_1_gggg5(X, Y, Edges, Visited, member_2_in_gg2(._22(X, ._22(Y, []_0)), Edges))
member_2_in_gg2(H, ._22(H, L)) -> member_2_out_gg2(H, ._22(H, L))
member_2_in_gg2(X, ._22(H, L)) -> if_member_2_in_1_gg4(X, H, L, member_2_in_gg2(X, L))
if_member_2_in_1_gg4(X, H, L, member_2_out_gg2(X, L)) -> member_2_out_gg2(X, ._22(H, L))
if_reach_4_in_1_gggg5(X, Y, Edges, Visited, member_2_out_gg2(._22(X, ._22(Y, []_0)), Edges)) -> reach_4_out_gggg4(X, Y, Edges, Visited)
reach_4_in_gggg4(X, Z, Edges, Visited) -> if_reach_4_in_2_gggg5(X, Z, Edges, Visited, member1_2_in_ag2(._22(X, ._22(Y, []_0)), Edges))
member1_2_in_ag2(H, ._22(H, L)) -> member1_2_out_ag2(H, ._22(H, L))
member1_2_in_ag2(X, ._22(H, L)) -> if_member1_2_in_1_ag4(X, H, L, member1_2_in_ag2(X, L))
if_member1_2_in_1_ag4(X, H, L, member1_2_out_ag2(X, L)) -> member1_2_out_ag2(X, ._22(H, L))
if_reach_4_in_2_gggg5(X, Z, Edges, Visited, member1_2_out_ag2(._22(X, ._22(Y, []_0)), Edges)) -> if_reach_4_in_3_gggg6(X, Z, Edges, Visited, Y, member_2_in_gg2(Y, Visited))
if_reach_4_in_3_gggg6(X, Z, Edges, Visited, Y, member_2_out_gg2(Y, Visited)) -> if_reach_4_in_4_gggg6(X, Z, Edges, Visited, Y, reach_4_in_gggg4(Y, Z, Edges, ._22(Y, Visited)))
if_reach_4_in_4_gggg6(X, Z, Edges, Visited, Y, reach_4_out_gggg4(Y, Z, Edges, ._22(Y, Visited))) -> reach_4_out_gggg4(X, Z, Edges, Visited)

The argument filtering Pi contains the following mapping:
reach_4_in_gggg4(x1, x2, x3, x4)  =  reach_4_in_gggg4(x1, x2, x3, x4)
._22(x1, x2)  =  ._22(x1, x2)
[]_0  =  []_0
if_reach_4_in_1_gggg5(x1, x2, x3, x4, x5)  =  if_reach_4_in_1_gggg5(x1, x2, x3, x4, x5)
member_2_in_gg2(x1, x2)  =  member_2_in_gg2(x1, x2)
member_2_out_gg2(x1, x2)  =  member_2_out_gg2(x1, x2)
if_member_2_in_1_gg4(x1, x2, x3, x4)  =  if_member_2_in_1_gg4(x1, x2, x3, x4)
reach_4_out_gggg4(x1, x2, x3, x4)  =  reach_4_out_gggg4(x1, x2, x3, x4)
if_reach_4_in_2_gggg5(x1, x2, x3, x4, x5)  =  if_reach_4_in_2_gggg5(x1, x2, x3, x4, x5)
member1_2_in_ag2(x1, x2)  =  member1_2_in_ag1(x2)
member1_2_out_ag2(x1, x2)  =  member1_2_out_ag2(x1, x2)
if_member1_2_in_1_ag4(x1, x2, x3, x4)  =  if_member1_2_in_1_ag3(x2, x3, x4)
if_reach_4_in_3_gggg6(x1, x2, x3, x4, x5, x6)  =  if_reach_4_in_3_gggg6(x1, x2, x3, x4, x5, x6)
if_reach_4_in_4_gggg6(x1, x2, x3, x4, x5, x6)  =  if_reach_4_in_4_gggg5(x1, x2, x3, x4, x6)
MEMBER_2_IN_GG2(x1, x2)  =  MEMBER_2_IN_GG2(x1, x2)

We have to consider all (P,R,Pi)-chains

↳ PROLOG
  ↳ PrologToPiTRSProof
  ↳ PrologToPiTRSProof
    ↳ PiTRS
      ↳ DependencyPairsProof
        ↳ PiDP
          ↳ DependencyGraphProof
            ↳ AND
              ↳ PiDP
              ↳ PiDP
PiDP

Pi DP problem:
The TRS P consists of the following rules:

REACH_4_IN_GGGG4(X, Z, Edges, Visited) -> IF_REACH_4_IN_2_GGGG5(X, Z, Edges, Visited, member1_2_in_ag2(._22(X, ._22(Y, []_0)), Edges))
IF_REACH_4_IN_3_GGGG6(X, Z, Edges, Visited, Y, member_2_out_gg2(Y, Visited)) -> REACH_4_IN_GGGG4(Y, Z, Edges, ._22(Y, Visited))
IF_REACH_4_IN_2_GGGG5(X, Z, Edges, Visited, member1_2_out_ag2(._22(X, ._22(Y, []_0)), Edges)) -> IF_REACH_4_IN_3_GGGG6(X, Z, Edges, Visited, Y, member_2_in_gg2(Y, Visited))

The TRS R consists of the following rules:

reach_4_in_gggg4(X, Y, Edges, Visited) -> if_reach_4_in_1_gggg5(X, Y, Edges, Visited, member_2_in_gg2(._22(X, ._22(Y, []_0)), Edges))
member_2_in_gg2(H, ._22(H, L)) -> member_2_out_gg2(H, ._22(H, L))
member_2_in_gg2(X, ._22(H, L)) -> if_member_2_in_1_gg4(X, H, L, member_2_in_gg2(X, L))
if_member_2_in_1_gg4(X, H, L, member_2_out_gg2(X, L)) -> member_2_out_gg2(X, ._22(H, L))
if_reach_4_in_1_gggg5(X, Y, Edges, Visited, member_2_out_gg2(._22(X, ._22(Y, []_0)), Edges)) -> reach_4_out_gggg4(X, Y, Edges, Visited)
reach_4_in_gggg4(X, Z, Edges, Visited) -> if_reach_4_in_2_gggg5(X, Z, Edges, Visited, member1_2_in_ag2(._22(X, ._22(Y, []_0)), Edges))
member1_2_in_ag2(H, ._22(H, L)) -> member1_2_out_ag2(H, ._22(H, L))
member1_2_in_ag2(X, ._22(H, L)) -> if_member1_2_in_1_ag4(X, H, L, member1_2_in_ag2(X, L))
if_member1_2_in_1_ag4(X, H, L, member1_2_out_ag2(X, L)) -> member1_2_out_ag2(X, ._22(H, L))
if_reach_4_in_2_gggg5(X, Z, Edges, Visited, member1_2_out_ag2(._22(X, ._22(Y, []_0)), Edges)) -> if_reach_4_in_3_gggg6(X, Z, Edges, Visited, Y, member_2_in_gg2(Y, Visited))
if_reach_4_in_3_gggg6(X, Z, Edges, Visited, Y, member_2_out_gg2(Y, Visited)) -> if_reach_4_in_4_gggg6(X, Z, Edges, Visited, Y, reach_4_in_gggg4(Y, Z, Edges, ._22(Y, Visited)))
if_reach_4_in_4_gggg6(X, Z, Edges, Visited, Y, reach_4_out_gggg4(Y, Z, Edges, ._22(Y, Visited))) -> reach_4_out_gggg4(X, Z, Edges, Visited)

The argument filtering Pi contains the following mapping:
reach_4_in_gggg4(x1, x2, x3, x4)  =  reach_4_in_gggg4(x1, x2, x3, x4)
._22(x1, x2)  =  ._22(x1, x2)
[]_0  =  []_0
if_reach_4_in_1_gggg5(x1, x2, x3, x4, x5)  =  if_reach_4_in_1_gggg5(x1, x2, x3, x4, x5)
member_2_in_gg2(x1, x2)  =  member_2_in_gg2(x1, x2)
member_2_out_gg2(x1, x2)  =  member_2_out_gg2(x1, x2)
if_member_2_in_1_gg4(x1, x2, x3, x4)  =  if_member_2_in_1_gg4(x1, x2, x3, x4)
reach_4_out_gggg4(x1, x2, x3, x4)  =  reach_4_out_gggg4(x1, x2, x3, x4)
if_reach_4_in_2_gggg5(x1, x2, x3, x4, x5)  =  if_reach_4_in_2_gggg5(x1, x2, x3, x4, x5)
member1_2_in_ag2(x1, x2)  =  member1_2_in_ag1(x2)
member1_2_out_ag2(x1, x2)  =  member1_2_out_ag2(x1, x2)
if_member1_2_in_1_ag4(x1, x2, x3, x4)  =  if_member1_2_in_1_ag3(x2, x3, x4)
if_reach_4_in_3_gggg6(x1, x2, x3, x4, x5, x6)  =  if_reach_4_in_3_gggg6(x1, x2, x3, x4, x5, x6)
if_reach_4_in_4_gggg6(x1, x2, x3, x4, x5, x6)  =  if_reach_4_in_4_gggg5(x1, x2, x3, x4, x6)
REACH_4_IN_GGGG4(x1, x2, x3, x4)  =  REACH_4_IN_GGGG4(x1, x2, x3, x4)
IF_REACH_4_IN_2_GGGG5(x1, x2, x3, x4, x5)  =  IF_REACH_4_IN_2_GGGG5(x1, x2, x3, x4, x5)
IF_REACH_4_IN_3_GGGG6(x1, x2, x3, x4, x5, x6)  =  IF_REACH_4_IN_3_GGGG6(x1, x2, x3, x4, x5, x6)

We have to consider all (P,R,Pi)-chains